An improved lower bound for Folkman's theorem
نویسندگان
چکیده
منابع مشابه
An Improved Lower Bound for Folkman’s Theorem
Folkman’s theorem asserts that for each k ∈ N, there exists a natural number n = F (k) such that whenever the elements of [n] are two-coloured, there exists a set A ⊂ [n] of size k with the property that all the sums of the form ∑ x∈B x, where B is a nonempty subset of A, are contained in [n] and have the same colour. In 1989, Erdős and Spencer showed that F (k) ≥ 2ck2/ log , where c > 0 is an ...
متن کاملAn improved lower bound related to the Furstenberg-Sárközy theorem
Let D(n) denote the cardinality of the largest subset of the set {1, 2, . . . , n} such that the difference of no pair of elements is a square. A well-known theorem of Furstenberg and Sárközy states that D(n) = o(n). In the other direction, Ruzsa has proven that D(n) & nγ for γ = 1 2 ( 1 + log 7 log 65 ) ≈ 0.733077. We improve this to γ = 1 2 ( 1 + log 12 log 205 ) ≈ 0.733412.
متن کاملAn Improved lower bound for arithmetic regularity
The arithmetic regularity lemma due to Green [GAFA 2005] is an analogue of the famous Szemeredi regularity lemma in graph theory. It shows that for any abelian group G and any bounded function f : G → [0, 1], there exists a subgroup H ≤ G of bounded index such that, when restricted to most cosets of H, the function f is pseudorandom in the sense that all its nontrivial Fourier coefficients are ...
متن کاملAn improved lower bound for (1,
We call a subset C of vertices of a graph G a (1,≤ l)-identifying code if for all subsets X of vertices with size at most l, the sets {c ∈ C|∃u ∈ X, d(u, c) ≤ 1} are distinct. The concept of identifying codes was introduced in 1998 by Karpovsky, Chakrabarty and Levitin. Identifying codes have been studied in various grids. In particular, it has been shown that there exists a (1,≤ 2)-identifying...
متن کاملAn Improved Lower Bound for Approximating CVP
This paper shows the problem of nding the closest vector in an n-dimensional lattice to be NP-hard to approximate to within factor n c= log log n for some constant c > 0.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the London Mathematical Society
سال: 2017
ISSN: 0024-6093,1469-2120
DOI: 10.1112/blms.12058